The incidence game chromatic number
نویسنده
چکیده
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with maximum degree ∆, the upper bound 2∆ + 4k − 2 for the incidence game chromatic number is given. If ∆ ≥ 5k, we improve this bound to the value 2∆ + 3k − 1. We also determine the exact incidence game chromatic number of cycles, stars and sufficiently large wheels and obtain the lower bound 3 2 ∆ for the incidence game chromatic number of graphs of maximum degree ∆.
منابع مشابه
The incidence game chromatic number of (a, d)-decomposable graphs
The incidence coloring game has been introduced in [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009), 1980– 1987] as a variation of the ordinary coloring game. The incidence game chromatic number ιg(G) of a graph G is the minimum number of colors for which Alice has a winning strategy when playing the incidence coloring game on G. In [C. Charpentier and É. Sopen...
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملIncidence Coloring Game and Arboricity of Graphs
An incidence of a graph G is a pair (v, e) where v is a vertex of G and e an edge incident to v. Two incidences (v, e) and (w, f) are adjacent whenever v = w, or e = f , or vw = e or f . The incidence coloring game [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009), 1980–1987] is a variation of the ordinary coloring game where the two players, Alice and Bob, alte...
متن کاملGame chromatic number of graphs
y Abstract We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particular, since a planar graph has acyclic chromatic number at most 5, we conclude that the g...
متن کاملThe Game Chromatic Number of 1-Caterpillars
The game chromatic number of a graph is defined using a two players game. In 1993, Faigle et al. proved that the game chromatic number of trees is at most four. In this paper we investigate the problem of characterizing those trees with game chromatic number three, and setttle this problem for 1-caterpillars.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 27 شماره
صفحات -
تاریخ انتشار 2006